Experimental Evaluation of a Heuristic Approach for P2P Negotiation

In his work presented at the Workshop on Cooperative Information Agents (CIA 2003), Marco Cadoli proposed an approach where the process of negotiation is considered as a distributed constraint satisfaction problem, and the negotiation spaces as convex regions: i.e., all points included in the individual region corresponds to acceptable agreements. In this paper, we evaluate an extension that we have proposed in [1]. The proposed algorithm overcomes some problems of the approach, and in perspective also overcomes the limitation to polyhedral negotiation areas. We show by a number of experiments that the extended approach works properly and that the interaction complexity is acceptable